package Other.DP;

import com.sun.org.apache.xpath.internal.operations.Mod;

/**
 * @author:gao
 * @date:2020/7/9
 * @time:15:33
 * @version:0.0.1
 * @description:none
 */

//面试题 08.11. 硬币
public class CoinsWays {
    public static void main(String[] args) {

    }
}

class SolutionC01 {
    public int waysToChange(int n) {
        //25 10 5 1
        final int MOD = 1000000007;
        int[] dp = new int[n+1];
        dp[0]=1;
        for (int i = 1; i <=n ; i++) {
            int incr = 0;
            if(i%5==0) incr++;
            if(i%10==0)incr++;
            if(i%25==0)incr++;
            dp[i]=dp[i-1]+incr;
        }
        return dp[n];
    }
}